Iterative Solver Benchmark
نویسندگان
چکیده
The traditional performance measurement for computers on scienti c application has been the Linpack benchmark [2], which evaluates the e ciency with which a machine can solve a dense system of equations. Since this operation allows for considerable reuse of data, it is possible to show performance gures a sizeable percentage of peak performance, even for machines with a severe unbalance between memory and processor speed.
منابع مشابه
BIT ? ? ( 199 ? ) , ? ? ? { ? ? ? . An Assessment of Incomplete - LU Preconditioners forNonsymmetric Linear Systems
We report on an extensive experiment to compare an iterative solver preconditioned by several versions of incomplete LU factorization with a sparse direct solver using LU factorization with partial pivoting. Our test suite is 24 nonsymmetric matrices drawn from benchmark sets in the literature. On a few matrices, the best iterative method is more than 5 times as fast and more than 10 times as m...
متن کاملModern Cooperative Parallel SAT Solving
Nowadays, powerful parallel SAT solvers are based on an algorithm portfolio. The alternative approach, (iterative) search space partitioning, cannot keep up, although, according to the literature, iterative partitioning systems should scale better than portfolio solvers. This rises often! In this paper we identify key problems in current parallel cooperative SAT solving approaches, most importa...
متن کاملNumerical Solution of Discretised HJB Equations with Applications in Finance
We consider the numerical solution of discretised Hamilton-Jacobi-Bellman (HJB) equations with applications in finance. For the discrete linear complementarity problem arising in American option pricing, we study a policy iteration method. We show, analytically and numerically, that, in standard situations, the computational cost of this approach is comparable to that of European option pricing...
متن کاملAn Assessment of Incomplete-LU Preconditioners for Nonsymmetric Linear Systems1
We report on an extensive experiment to compare an iterative solver preconditioned by several versions of incomplete LU factorization with a sparse direct solver using LU factorization with partial pivoting. Our test suite is 24 nonsymmetric matrices drawn from benchmark sets in the literature. On a few matrices, the best iterative method is more than 5 times as fast and more than 10 times as m...
متن کاملTwo Element-by-Element Iterative Solutions for Shallow Water Equations
In this paper we apply the generalized Taylor–Galerkin finite element model to simulate bore wave propagation in a domain of two dimensions. For stability and accuracy reasons, we generalize the model through the introduction of four free parameters. One set of parameters is rigorously determined to obtain the high-order finite element solution. The other set of free parameters is determined fr...
متن کامل